Enumerating Simple Paths from Connected Induced Subgraphs
نویسندگان
چکیده
منابع مشابه
Efficiently Enumerating All Connected Induced Subgraphs of a Large Molecular Network
In systems biology, the solution space for a broad range of problems is composed of sets of functionally associated biomolecules. Since connectivity in molecular interaction networks is an indicator of functional association, such sets can be identified from connected induced subgraphs of molecular interaction networks. Applications typically quantify the relevance (e.g., modularity, conservati...
متن کاملCyclomatic numbers of connected induced subgraphs
Yu, X., Cyclomatic numbers of connected induced subgraphs, Discrete Mathematics 105 (1992) 275-284. We give an upper bound for w(A), the minimum cyclomatic number of connected induced subgraphs containing a given independent set A of vertices in a given graph G. We also give an upper bound for w(A) when G is triangle-free. We show that these two bounds are best possible. Similar results are obt...
متن کاملEnumerating Triangulation Paths
Recently, Aichholzer introduced the remarkable concept of the so-called triangulation path (of a triangulation with respect to a segment), which has the potential of providing efficient counting of triangulations of a point set, and efficient representations of all such triangulations. Experiments support such evidence, although – apart from the basic uniqueness properties – little has been pro...
متن کاملEnumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these problems can be solved in incremental polynomial time, while the second problem is NP-hard: given a collection of minimal dicuts for G, it is NP-complete to tell whether it can be extended. The latter result implies, in par...
متن کاملIsolation concepts for efficiently enumerating dense subgraphs
In an undirected graph G = (V,E), a set of k vertices is called c-isolated if it has less than c · k outgoing edges. Ito and Iwama [ACM Trans. Algorithms, to appear] gave an algorithm to enumerate all c-isolated maximal cliques in O(4c · c4 · |E|) time. We extend this to enumerating all maximal c-isolated cliques (which are a superset) and improve the running time bound to O(2.89c ·c2 · |E|), u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2018
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-018-1966-9